Every finite non-solvable group admits an oriented regular representation
نویسندگان
چکیده
منابع مشابه
Every finite non-solvable group admits an oriented regular representation
In this paper we give a partial answer to a 1980 question of Lazslo Babai: “Which [finite] groups admit an oriented graph as a DRR?” That is, which finite groups admit an oriented regular representation (ORR)? We show that every finite non-solvable group admits an ORR, and provide a tool that may prove useful in showing that some families of finite solvable groups admit ORRs. We also completely...
متن کاملEvery non-Euclidean oriented matroid admits a biquadratic final polynomial
Richter-Gebert proved that every non-Euclidean uniform oriented matroid admits a biquadratic final polynomial. We extend this result to the non-uniform case.
متن کاملClassification of finite groups that admit an oriented regular representation
This is the third, and last, of a series of papers dealing with oriented regular representations. Here we complete the classification of finite groups that admit an oriented regular representation (or ORR for short), and give a complete answer to a 1980 question of László Babai: “Which [finite] groups admit an oriented graph as a DRR?” It is easy to see and well-understood that generalised dihe...
متن کاملOn the Regular Representation of an (essentially) Finite 2-group
The regular representation of an essentially finite 2-group G in the 2-category 2Vectk of (Kapranov and Voevodsky) 2-vector spaces is defined and cohomology invariants classifying it computed. It is next shown that all hom-categories in Rep 2Vectk pGq are 2-vector spaces under quite standard assumptions on the field k, and a formula giving the corresponding “intertwining numbers” is obtained wh...
متن کاملEvery Graph Admits an Unambiguous Bold Drawing
Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a bold drawing in which the region occupied by the union of the disks and rectangles representing the vertices and edges does not contain any di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2017
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2017.05.003